Lightweight Bounding Volumes for Ray Tracing
نویسندگان
چکیده
This paper presents a memory-efficient auxiliary data structure for ray tracing called a lightweight bounding volume hierarchy, or LBVH. The new data structure reduces memory requirements in three ways: using implicit indexing, limited precision numbers, and a high branching factor. We show that LBVHs can be nearly as effective as standard bounding volumes in terms of speed while using significantly less memory.
منابع مشابه
Fast, Effective BVH Updates for Dynamic Ray-Traced Scenes sing Tree Rotations
Bounding volume hierarchies are a popular choice for ray tracing animated scenes due to the relative simplicity of refitting bounding volumes around moving geometry. However, the quality of such a refitted tree can degrade rapidly if objects in the scene deform or rearrange significantly as the animation progresses, resulting in dramatic increases in rendering times. Existing solutions involve ...
متن کاملFast, Effective BVH Updates for Dynamic Ray-Traced Scenes Using Tree Rotations
Bounding volume hierarchies are a popular choice for ray tracing animated scenes due to the relative simplicity of refitting bounding volumes around moving geometry. However, the quality of such a refitted tree can degrade rapidly if objects in the scene deform or rearrange significantly as the animation progresses, resulting in dramatic increases in rendering times. Existing solutions involve ...
متن کاملBounding Volume Construction using Point Clouds
Bounding volumes are used to optimize many graphic algorithms. They permit to decide quickly if a more exact test is likely to succeed or not. The exact test is only applied if the bounding volume test succeeds, which saves time in most cases. Two of the most prominent applications are ray tracing and collision detection. This paper presents a new method to calculate tight bounding volumes for ...
متن کاملUsing Projection to Accelerate Ray Tracing
Using Projection to accelerate Ray Tracing Anastasia Bezerianos M.Sc. Graduate Department of Computer Science University of Toronto 2001 The high cost of Ray Tracing image rendering has driven many researchers to devise acceleration techniques like bounding volume hierarchies. This thesis introduces new ways of building bounding volume hierarchies. We modify existing algorithms to use bounding ...
متن کاملStrategies for Bounding Volume Hierarchy Updates for Ray Tracing of Deformable Models
In this paper, we describe strategies for bounding volume hierarchy updates for ray tracing of deformable models. By using pre-built hierarchy structures and a lazy evaluation technique for updating the bounding volumes, the hierarchy reconstruction can be made very efficiently. Experiments show that for deforming triangle meshes the reconstruction time of the bounding volume hierarchies per fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graphics Tools
دوره 11 شماره
صفحات -
تاریخ انتشار 2006